Apparatus and method for performing fast acquisition of PN sequences by transferring distributed samples

ABSTRACT

Disclosed is a method for performing fast distributed sample acquisition (DSA). A spreader generates a data signal by spreading an incoming data stream over a range of spectrum according to a locally generated first main sequence, and samples the state sample of the main sequence. A sample spreader outputs a first state signal by spreading a symbol according to a locally generated first subsequence. A sample despreader reconstructs the transmitted binary orthogonal symbols by despreading the first state signal obtained from the sample spreader according to a locally generated second subsequence to detect the first main sequence state sample. A despreader compares the state sample obtained from the sample despreader with a locally generated state sample and makes correction on a local SRG to generate a second main sequence having new state. An incoming data stream is reconstructed by despreading the data signal obtained from the spreader according to the second main sequence.

BACKGROUND OF THE INVENTION

[0001] 1. Field of the Invention

[0002] The present invention relates to an apparatus and method forperforming fast acquisition of PN sequences by transferring distributedsamples, more particularly, to the apparatus and method for the fastacquisition of PN sequence employing a distributed sample transmissionin a CDMA mobile communication system of code division multiple accesstechniques.

[0003] 2. Background of the Related Art

[0004] In a CDMA mobile system, to provide a good quality of datacommunication between mobile stations, the receiver must be able to bequickly and accurately synchronize with the PN sequences transmittedfrom a transmitter. In the case of a cellar system, the receiver has tobe synchronized to the pilot signal transmitted from the base station.More specifically, the next generation mobile communication systemsshould have functions providing new services, such as wirelessmultimedia communication for transmitting and receiving data in a groupin a given frequency band by connecting between personal data terminalsand mobile units, to the multiple mobile unit users. Under thiscommunication environment, the system has to be able to effectivelyprocess a large quantity of information being simultaneouslycommunicated between multiple users. Therefore, the spreading of datamust inevitably employ a PN sequence of long period.

[0005] For example, in the CDMA mobile communication system, thetransmitter unit first spreads a data stream to be transmitted over aprescribed spectrum by using a PN sequence locally generated from ashift register generator (SRG) of the unit, and then transmit the spreadspectrum of data. The receiver unit receives the transmitted spreadspectrum, despreads the received spread spectrum by using a PN sequencegenerated from the SRG of the receiver unit and then recovers the datastream. To execute this process, it is necessary for the SRG of thereceiver unit to be synchronized to the SRG of the transmitter unit. Thesynchronization process includes two steps of which one is PN sequenceacquisition (code acquisition) and the other is PN sequence tracking(code tracking). The two steps are sequentially executed.

[0006] In order to provide a fast and reliable service in the multimediacommunication environment, a considerable amount of research on the fastcode acquisition techniques has been exerted during the past decades.

[0007] One technique among the conventional techniques is a serialsearch acquisition method. The serial search acquisition method has theadvantage of simple hardware, but the acquisition time is very long fora long-period PN sequence, because the acquisition time is directlyproportional to the period of PN sequence. Therefore, several fastacquisition schemes have been developed at the cost of increasedhardware complexity.

[0008] To improve the acquisition speed, a method keeping the basicstructure of serial search system is provided, to which is added atwo-step acquisition process, of which one step employs a passivematched filter to determine a temporary acquisition point and the otherstep employs an active correlator to verify the effectiveness of thetemporary acquisition. Another method to improve the acquisition speedis a sequential test method using two threshold compare circuits inaddition to the existing serial search scheme.

[0009] However, those methods based on the serial search do not havesatisfactory acquisition speed since its absolute acquisition time islong when the sequence is long.

[0010] A recently developed technique based on the serial search methodis disclosed in U.S. Pat. No. 5,644,591. In this technique, a largesearch window is offered in a first search step for a fast acquisitionand a maximum value of correlation of each window is compared with athreshold value. When the maximum correlation is not larger than thethreshold, the comparing process for the next window sequentiallycontinues. When the maximum correlation of a window is larger than thethreshold, that point is selected as a central point for a choice of asmaller search window and it is determined if the acquisition is true.Thus, by two windows having different size to each other, a candidatefor the acquisition is first selected and then a confirmation of theacquisition is made. Therefore, a short acquisition time is expected. Inspite of the short acquisition time, however, this method has alimitation in reducing the acquisition time when the period of the PNsequence is long since a serial search technique based on thecorrelation comparison is employed.

[0011] For a long sequence case, however, the parallel acquisitionscheme may render a solution but the hardware complexity, that is, thenumber of active correlators or matched filters, increases to the orderof code period.

[0012] To get around this problem, serial-parallel hybrid schemes havebeen proposed for practical use, in which a long code sequence of periodN is divided into M subsequences, each of which having length N/M, andthe acquisition circuit is thus composed of M parallel matched filters.The acquisition time of this hybrid scheme, however, is not improved asmuch as expected at the cost of increased hardware complexity.

[0013] Another method to improve the acquisition time uses a stateestimation of the shift register generator. Theoretically, this methoddoes not increase the complexity of hardware, compared with the serialsearch scheme, but it has a comparatively good acquisition time.

[0014] The acquisition method based on state estimation is a kind ofrapid acquisition by sequential estimation that makes L consecutive harddecisions on the incoming code chips and loads them to the receiver SRGas the current SRG states. Therefore, this technique is successful inspeeding up the acquisition process. On the other hand, in fact, it isnot suitable for practical use because its performance rapidlydeteriorates in a low SNR environment.

[0015] Furthermore, because of the unrealizable fact that a carrierphase must be obtained before the acquisition completion of PN sequencesince coherent demodulation is used to determine whether the value ofeach sequence chip is positive or negative, the state estimationtechnique is not suitable for practical use.

[0016] The above references are incorporated by reference herein whereappropriate for appropriate teachings of additional or alternativedetails, features and/or technical background.

SUMMARY OF THE INVENTION

[0017] An object of the invention is to solve at least the aboveproblems and/or disadvantages and to provide at least the advantagesdescribed hereinafter.

[0018] Another object of the present invention is to provide apparatusand methods for performing a fast acquisition of PN sequence through adistributed sample acquisition in spread spectrum communication systemwhich rapidly acquires the PN sequence of long period generated in amultimedia communication environment by using a distributed sampleacquisition (DSA) having an acquisition method of PN sequence based onnew state estimation and reduces the total synchronization time betweenthe transmitter and the receiver.

[0019] Another objective of the present invention is to provide theapparatus and the method, when the distributed sample is transmittedfrom a transmitter to a receiver, having a fast synchronization betweenthe transmitter SRG and the receiver SRG and a reliable transmissionunder CDMA environment where the average chip-SNR is very low.

[0020] Another objective of the present invention is to provide theapparatus and the methods having much more improved acquisition speedbut less complex hardware, compared with a conventional technique.

[0021] Additional features and advantages of the invention will be setforth in the description which follows, and in part will be apparentfrom the description, or may be learned by practice of the invention.The objectives and other advantages of the invention will be realizedand attained by the structure particularly pointed out in the writtendescription and claims hereof as well as the appended drawings.

[0022] To achieve these and other advantages and in accordance with thepurpose of the present invention, as embodied and broadly described, theapparatus and the method according to the present invention include aspreader which generates a data signal by spreading an incoming datastream over a predetermined range of spectrum according to a locallygenerated first main sequence and samples the state sample of said mainsequence, a sample spreader which makes the state sample output fromsaid spreader corresponding to one of binary orthogonal symbols having apredetermined length and then outputs a first state signal by spreadingsaid symbol according to a locally generated first igniter sequence(first subsequence), a sample despreader which reconstructs thetransmitted binary orthogonal symbols by despreading said first statesignal obtained from said sample spreader according to a locallygenerated second igniter sequence (subsequence) and therefrom detectsthe state sample of said first main sequence, and a despreader whichcompares the state sample obtained from said sample despreader with alocally generated state sample and makes correction on the despreaderSRG states using them as many as predetermined times, generates a secondmain sequence having new states, and reconstructs said incoming datastream by despreading the data signal obtained from said spreaderaccording to said second main sequence.

[0023] Another objective is achieved by including a sample despreader todetect the state signal of sequence provided from an external systemaccording to a locally generated igniter sequence, and a despreader togenerate a new state signal by comparing the state samples obtained fromsaid sample despreader with locally generated state samples and bycorrecting the SRG provided within itself a predetermined number oftimes and to reconstruct the original data stream by despreading thereceived data signal according to said second main sequence.

[0024] Another objective is achieved by including the steps foracquiring the igniter sequence, for detecting the state sample value ofsequence of a predetermined period from the igniter sequence, and foracquiring said sequence by using said state sample value.

[0025] It is to be understood that both the foregoing generaldescription and the following detailed description are exemplary andexplanatory and are intended to provide further explanation of theinvention as claimed.

[0026] Additional advantages, objects, and features of the inventionwill be set forth in part in the description which follows and in partwill become apparent to those having ordinary skill in the art uponexamination of the following or may be learned from practice of theinvention. The objects and advantages of the invention may be realizedand attained as particularly pointed out in the appended claims.

BRIEF DESCRIPTION OF THE DRAWINGS

[0027] The invention will be described in detail with reference to thefollowing drawings in which like reference numerals refer to likeelements wherein:

[0028]FIG. 1A is a block diagram showing the transmitter transmitting PNsequences in a distributed sample acquisition (DSA) apparatus accordingto the present invention.

[0029]FIG. 1B is a block diagram showing the receiver acquiring the PNsequence in a distributed sample acquisition (DSA) apparatus accordingto a preferred embodiment of the present invention.

[0030]FIG. 2 is a timing diagram for sampling pulses and correctionpulses provided from an igniter sequence (a subsequence) generator ofFIG. 1.

[0031]FIGS. 3A and 3B are control flow diagram to explain the operationof capturing the PN sequences in the DSA apparatus according to thepresent invention.

[0032]FIGS. 4A to 4C are the simplified block diagrams showing thetransmitter and the receiver of FIG. 1.

[0033]FIG. 5 is a timing diagram for sampling the state samples obtainedfrom the spreader shift register generator (SRG) of FIG. 1 and forcorrecting the states of the despreader SRG (or the value of the states)

[0034]FIG. 6A is a logical structure of the spreader of DSA apparatus ofFIG. 1. FIG. 6B is a logical structure of the despreader of DSAapparatus of FIG. 1.

[0035]FIG. 7 is a state transition diagram corresponding to theoperation of the DSA apparatus according to the present invention.

[0036]FIGS. 8A and 8B are graphs showing the comparison of meanacquisition times and the mean acquisition time ratio between DSA andconventional serial search acquisition (SSA), respectively.

[0037]FIGS. 9A and 9B are graphs showing mean acquisition time ratio vs.False alarm penalty time K and vs. Main SRG length L, respectively.

DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

[0038] Reference will now be made in detail to the preferred embodimentsof the present invention, examples of which are illustrated in theaccompanying drawings.

[0039]FIGS. 1A and 1B are functional block diagrams of the apparatusaccording to the present invention.

[0040] Referring to FIGS. 1A and 1B, the distributed s-ample acquisition(DSA) apparatus of the present invention includes a transmitter block100 and a receiver block 200. The transmitter block 100 includes adistributed sample acquisition (DSA) spreader 110 and a sample spreader120 and the receiver block includes their despreading counterparts, thatis, DSA despreader 210 and sample despreader 220, respectively. Thetransmitter 100 has a function for transmitting PN sequences and thereceiver 200 has a function for acquiring the PN sequences in adistributed sample acquisition (DSA).

[0041] This distributed sample acquisition (DSA) apparatus of thepreferred embodiment of the present invention for transmitting andacquiring PN sequences may be used for a mobile station and/or a basestation.

[0042] Referring to FIG. 1A, the transmitter 100 preferably includes adistributed sample acquisition (DSA) spreader 110 which generates datasignals by spreading an incoming data stream over a predeterminedspectrum according to a locally generated main sequence. It furtherincludes samples a state sample of the main sequence and a samplespreader 120 which makes the state sample obtained from said DSAspreader 110 corresponding to one of binary orthogonal symbols having apredetermined length and outputs a state signal by spreading said symbolaccording to a locally generated igniter sequence (an auxiliary sequenceor a subsequence).

[0043] Referring to FIG. 1B, the receiver 200 preferably includes asample despreader 220 which reconstructs the transmitted binaryorthogonal symbols by despreading said state signal obtained from saidsample spreader 120 according to a locally generated igniter sequence antherefrom detects the state sample of said main sequence. It furtherincludes a despreader 210 which compares the state sample obtained fromsaid sample despreader 220 with a locally generated state sample andmakes corrections on the despreader SRG states using them as many as apredetermined number of times, generates a main sequence having newstates, and reconstructs the incoming data stream by despreading thedata signal obtained from said DSA spreader 110 according to the secondmain sequence.

[0044] DSA spreader 110 of the transmitter 100 preferably includes afirst main shift register generator (SRG) 111 to locally generate a PNsequence, a spreader 113 to spread an incoming data stream over apredetermined spectrum according to the PN sequence of the first mainSRG 111, and a time-advanced sampler 112 which time-advanced samples thestate sample of the PN sequence obtained from the first main SRG 111.

[0045] The sample spreader 120 preferably includes a symbol generator121 which makes the state sample value obtained from said time-advancedsampler 112 of the DSA spreader 110 corresponding to one of binaryorthogonal symbols having a predetermined length, an igniter shiftregister generator (SRG) 123 which locally generates an igniter sequence(a subsequence), and a spreader 122 which spreads the symbol obtainedfrom the symbol generator 121 by using the igniter sequence.

[0046] The sample despreader 220 of the receiver 200 preferably includesan igniter SRG 223 which locally generates an igniter sequence, adespreader 221 which despreads the state signal obtained from thespreader 122 of the sample spreader 120 by using an igniter sequenceobtained from the igniter SRG 223, and a state sample detector 222 whichdetects a state sample from an output signal of the despreader 221.

[0047] DSA despreader 210 preferably includes a sampler 214 to sample astate sample according to a sampling timing pulse provided from theigniter SRG 223, and a comparator 211 to compare a state sample obtainedfrom the state sample detector 222 of the sample despreader 220 with astate sample locally generated from the sampler 214. It further includesa second main shift register generator (SRG) 213 to generate a mainsequence corrected by the operation of the corrector 212, and acorrector 212 to correct the state of the second main SRG 213 by theoutput signal of the comparator 211 according to a correction timingpulse obtained from the second igniter 223 of the sample despreader 220.The DSA despreader 210 finally preferably includes despreader 215 todespread the data signal obtained from the spreader 113 according to thenew main sequence obtained from the second main SRG 213.

[0048] The distributed sample acquisition apparatus according to thepreferred embodiment of the present invention including the transmitter100 and the receiver 200 may be used in a mobile station and thereceiver 200 may be used in a mobile station which only receives asignal transmitted from a base station. In this case, the transmitter100 is used in the base station.

[0049] A synchronization function between the DSA spreader anddespreader 110 and 210 and a sample transmission function between thesample spreader and despreader 120 and 220 are supported by the mainSRGs 111 and 213 in the DSA spreader and despreader 110 and 210 and theigniter SRGs 123 and 223 in the sample spreader and despreader 120 and220, respectively.

[0050] The main SRGs 111 and 213 generate main sequences which are PNsequences for despreading a data stream (signal) and object sequencesfor synchronization. The igniter SRGs 123 and 223 generate ignitersequences conveying and receiving the sample of the main SRG 111 for theacquisition of the main sequence. The igniter sequence is also called anauxiliary sequence introduced for a synchronization of the main sequencewhich is an object sequence of the synchronization and its function isto reliably transmit the state values of the main SRG to the receiverand to provide a reference point of timing for sampling and correctingthe state of the SRG of the receiver.

[0051] Referring to FIGS. 1A and 1B, the period N, of the ignitersequence is selected much shorter than the period N_(M)(=2^(L)−1) of themain sequence. The time-advanced sampling block 112 samples the statesample z₁ of the main SRG 111 in advance. In other words, thetime-advanced sampling block 112 of the transmitter block 100, at time(r+i−1)N_(I), samples the sequence value (the state sample) which willbe generated from the main SRG 111 at time (r+i)N_(I). The symbolgenerator 121 makes the output of the DSA spreader block correspondingto one of binary orthogonal symbols having a length N_(I), spreads thesymbol as an igniter sequence of one period, and thereafter transmitsthe result. Then, the sample despreader block of the receiver block 200despreads the received state signal and regenerates the transmittedsample z₁ by comparing the result with each binary orthogonal symbol.

[0052] The DSA despreader block 210 generates the state sample{circumflex over (z)} _(i) of the SRG 213 in the receiver block 200,compares the sample with the transmitted sample z_(i) and begins itscorrecting operation. The state sampling operation and the correctingoperation get started by the sampling and correcting pulse provided fromthe igniter SRG 223 of the sample despreader block 220.

[0053] Referring to FIG. 3A, an operation of the fast acquisition of PNsequences in the distributed sample acquisition apparatus according tothe present invention is described when a point-to-point communicationis a wireless communication system.

[0054] The principle of the apparatus according to the preferredembodiment is based on the fact that, if a pair of shift registergenerators (SRG) in the transmitter and the receiver of the distributedsample acquisition apparatus according to the preferred embodiment ofthe present invention which is installed at each mobile station of CDMAcommunication system have the same structure, the two sequences aresynchronized by carrying the identical state values (L values stored inthe SRG having a length L) at the same time. Therefore, if there is atransmission route between one pair of SRGs, the state samples of theSRG of the transmitter block is transmitted to the receiver block andthe acquisition of PN sequences is accomplished much faster than thecase of conventional method in which the synchronization is done byevaluating the maximum value of correlation of the sequence. However, toaccomplish the acquisition of sequences based on the state sampletransmission, the problems of how to reliably transmit the state samplein the CDMA channel having a very low chip-SNR and of how to accomplishthe synchronization of the sequences by using the transmitted statesample have to be solved.

[0055] The transmitter block 100 shown in FIG. 1A transmits only amodulated igniter sequence to the receiver block 200 (ST1). The main SRG111 in the transmitter block 100 is preferably locally in operation.

[0056] The receiver block 200 captures the igniter sequence by aconventional serial search method or parallel search method (ST2). Inthis block ST2, the period of the igniter sequence is very short ascompared with the main sequence and therefore the acquisition time isalso very short. Then, the receiver block 200 determines whether theacquisition of the igniter sequence has been accomplished (ST3). If theaccomplishment of the acquisition is determined, the sample despreaderblock 220 of the receiver block 200 despreads the state signal everyperiod N_(I) of the igniter sequence and detects the transmitted statesample z_(i) by a conventional noncoherent detection method using anorthogonal symbol or a difference code (ST4).

[0057] The DSA despreader block 210 compares the state sample z_(i)determined at every igniter sequence period with the state sample{circumflex over (z)}_(i) locally generated from the main SRG 213 of thereceiver block 200 at the beginning of the next igniter sequence periodand, according to the result, maintains the state of the main SRG 213itself or makes correction (ST5).

[0058] The DSA spreader block 110 takes the sample generated from themain SRG 111 of the transmitter block 100 in advance by N_(I), while ittakes N_(I) to detect the transmitted sample. Therefore, the samplingtime for z_(i) and the sampling time for {circumflex over (z)}_(i)coincide with each other.

[0059] When and how to correct the main SRG 213 of the receiver block200 will be described next

[0060] The sampling timing pulse and the correcting timing pulseprovided from the igniter SRG 223 are shown in FIG. 2. The state of themain SRG 213 has to be synchronized with the state value of the main SRG111 of the transmitter block 100 which is delayed as much as thetransmission delay time between the transmitter and the receiver.However, the main SRG 213 of the receiver block 200 accomplishes itssynchronization based on the signal received at the receiver andtherefore the transmission delay does not affect on the synchronizationprocess. Therefore, the transmission delay time is not shown in FIG. 2.

[0061] The receiver block 200 determines if the comparison-correctionoperation is executed a prescribed number L of times (ST6). If it is notexecuted the prescribed number of times, the execution of step ST4 isrepeated. On the contrary, if the operation is done as many as apredetermined number L of times, then the main SRG 213 of the receiverblock 200 having a length L is held to be in its synchronization and itis detected whether a transmission error has occurred (ST7). If there isno transmission error in any one sample among the transmitted L samplesin step ST8, a completion of synchronization of the main sequence isdeclared in step ST9 and the completion message of the acquisition istransmitted to the other side.

[0062] If, however, it is determined in step ST8 that a transmissionerror has occurred, the igniter sequence acquisition step S73 isre-executed.

[0063] Since the occurrence of the transmission error leads to a falsesynchronization state, a verification process for verifying the truesynchronization is preferably included in step ST8. There are manycomplex techniques for verifying the true synchronization, but in theapparatus according to the preferred embodiment of the presentinvention, a comparatively simple verification process executingadditional v times comparison after the comparison-correction processesis done. This process (ST8) can be also executed by using theconventional correlation value and threshold based method.

[0064] If v pairs of samples coincide with each other, the receiverblock 200 declares the synchronization completion of the main sequenceand transmits the acquisition completion message to the other side(ST9). There are many techniques to transmit the acquisition completionmessage to the other side. The most effective method among them is whatthe synchronized main sequence (or a sequence derived from it) istransmitted. Using this sequence, the main SRG 213 of the other side isable to immediately verify the synchronization. In this case, the timefor the acquisition of the transmitted sequence is very short.

[0065] This short time is the result of the pair of main SRGs 111 and213 provided in the transmitter block 100 and the receiver block 200,respectively, having been already synchronized with each other. Ofcourse, there exists an uncertain period because of the transmissiondelay owing to a geographical distance between the two blocks, but thedistance is generally short. If any pair of samples do not coincide witheach other, the receiver block 200 preferably returns to the ignitersequence search state and executes its beginning of the acquisitionprocess.

[0066] As soon as the acquisition completion message has been received,the transmitter block 100 preferably stops transmitting the modulatedigniter sequence and begins to transmit a main sequence modulated withdata (ST10). The receiver block 200 stops the igniter SRG 223 and thendetects the transmitted data through the main sequence tracking process.

[0067] In spite of its verification process, there may exist a falsesynchronization (a false signal). The possibility is low, but the vpairs of samples may coincide with each other without thesynchronization. Therefore, during executing the detection for the maindata signal, a confirmation for the true/false of the resultedsynchronization may be necessary. Based on the fact that a datadetection performance like the bit error probability decreases below thetarget value under the false synchronization, the detection performanceof the receiver block has to be observed for a certain period. When theacquisition turns out true, the data detection is executed withoutinterruption. When the acquisition turns out false, the declaration forthe acquisition completion is retracted and the igniter sequence searchstep of the beginning is immediately executed.

[0068] On the contrary, in the case of a wireless communication systembased on the broadcasting system such as cellular base station, thetransmitter block of the mobile device is generally the same as theconventional CDMA transmitter block and the receiver block of the mobiledevice includes the receiver structure 200 shown in FIG. 1B. In thiscase, the transmitter block 100 shown in FIG. 1A is installed at eachbase station and may include an igniter SRG having structure differentfrom each other. The fast acquisition process, as shown in FIG. 3B, isvery similar to that of FIG. 3A, but the operation of steps ST11 andST20 are different from each other. In other words, the igniter sequenceis continuously transmitted together with the main sequence to be usedas a pilot sequence and that assists the receiving mobile station inaccomplishing the fast synchronization with the pilot sequence of thebase station (ST1). In addition, an igniter sequence and a main sequenceare continuously transmitted to the receiver block 200 after theacquisition completion message is received (ST20). Channel may beincreased according to the additional igniter sequence transmission, butthe increment of the interference signal caused in the main channel maybe small in the case of a practical multiple connection channel having alow signal to noise ratio (SNR).

[0069] In the following, the main SRGs 111 and 213 of the DSA spreaderand despreader 110 and 210, respectively, are described.

[0070] The transmitter block and the receiver block for transmitting orreceiving a PN sequence are shown as a block diagram in FIGS. 4A to 4G.In FIGS. 4A and 4B, the sample spreader and despreader 120 and 220 shownin FIGS. 1A and 1B are combined into the sample transmitter 140. In FIG.4A, the dotted section shows the total processing delay N_(I), while thetime advanced sampling block 112 in FIG. 1A has a delay of −N_(I).Therefore, the ultimate operation being obtained by connecting these twosections is to sample the sample z_(i) at the virtual sampling time(r+I) N_(I).

[0071]FIG. 4B shows the equivalent block diagram 110A of the DSAspreader 110 shown in FIG. 1A. FIG. 4G shows the equivalent blockdiagram 210A of the DSA despreader 210 shown in FIG. 1B.

[0072] In order to make the bit stream {b_([K/N) _(I) _(])+s_(k)+ŝ_(k)}obtained from the DSA despreader 210 of FIG. 1B identical to theoriginal bit stream {_([K/N) _(I) _(])}, the main sequence {s_(k)} ofthe despreader block 210A of FIG. 4G has to be identical to the mainsequence {s_(k)} of the spreader 110A at every time. This happens onlywhen the SRG 213 of the despreader 210 of FIG. 1B is synchronized withthe SRG 111 of the spreader 110. In order for this kind ofsynchronization, in the preferred embodiment of the present invention,the sample z_(i) sampled from {s_(k)} which is obtained at the virtualsampling time (r+I)N_(I) is compared with the sample {{circumflex over(z)}_(k)} sampled from the sample {ŝ_(k)} at the same time and thedifference between them is reflected on the state correction of the SRG213 of the despreader 210. In this synchronization method, thecomparison-correction has to be done L times in order to synchronize theSRG having a length L.

[0073] Through the close mathematical modeling for the DSA spreader anddespreader 110A and 210A of FIG. 4, a sampling time, a predictionsampling method, and the correction process of SRG state are described.

A Mathematical Modeling for the DSA Spreader and Despreader Blocks

[0074] Let d_(k) and {circumflex over (d)}_(k) denote the state vectorsof SRG of scrambler and descrambler at time k, respectively, and T bethe state transition matrix.

dk+1+T·dk   (Equation 1a)

{circumflex over (d)}k+1+T·{circumflex over (d)}k   (Equation 1b)

[0075] are established, where Equation (1b) is concerned to the SRGstate vector of the despreader in which correction is not yet done. Ifcorrection is done, the Equation (1a) is changed into equation 5 whichwill be described later.

[0076] Let h denote the generating vector of the SGR generating thesequence {S_(k)} (or {ŝ_(k)}).

s_(k)=h¹ d_(k)   (Equation 2a)

[0077] and

{circumflex over (d)} _(k+1) =T·{circumflex over (d)} _(k)   (Equation2b)

[0078] are established. If c₀ denotes a correction vector that correctsa previous state vector to a new state vector {circumflex over(d)}_(new), s following Equation 3 is established.

{circumflex over (d)} _(new) ={circumflex over (d)} _(ol)+(z _(i)+{circumflex over (z)} _(i))c ₀   (Equation 3)

[0079] As explained beforehand, each of samples z_(i) and {circumflexover (z)}_(i), I=0, 1, 2, . . . L−1 are both taken at the same samplingtime (r+I)N_(I), respectively from the (virtual) spreader 110A of FIG.4B and the despreader 220A of FIG. 4G, and whenever the two samples aredifferent from each other, the correction on the SRG 213 is done at time(r+I)N_(I)+D_(c). The correction delay D_(c) satisfies the condition of0≦D_(c)≦N_(i). FIG. 5 shows the timing chart concerning to thisoperation. The samples z_(i) and {circumflex over (z)}_(i) arerepresented by the state vectors as follows.

z _(i) =s _((r+i)N) _(I) =h ^(t) ·d _((r+i)N) _(I)   (Equation 4a)

{circumflex over (z)} _(i) =ŝ _((r+i)N) _(I) =h ^(t) ·{circumflex over(d)} _((r+i)N) _(I) , I=0, 1, . . . L−1   (Equation 4b)

[0080] The state vectors at the correction time are as follows.

d _((r+i)N) _(I) _(+D) _(c) =T·d _((r+i)N) _(I) _(+D) _(c) ⁻¹  (Equation 5a)

{circumflex over (d)} _((r+i)N) _(I) _(+D) _(c) =T {circumflex over (d)}_((r+i)N) _(I) _(+D) _(c) ⁻¹+(z _(i) +{circumflex over (z)} _(i))c ₀  (Equation 5b)

[0081] The synchronization between two SRGs 111 and 213 installed inspreader block 110 and despreader block respectively, is accomplishedwhen the two state vectors d_(k) and {circumflex over (d)}_(k) are equalto each other. Therefore, let the state difference vector be defined asfollows.

δ_(k) =d _(k) +{circumflex over (d)} _(k)   (Equation 6)

[0082] Then, by combining Equations (1a), (1b), (4a), (4b), (5a), and(5b) and applying the result to Equation (6), Equation (7) is obtained.

δ_((r+i)N) _(I) _(+D) _(c) =(T ^(D) ^(_(c)) +c ₀ h ^(t))δ_(rN) _(I) ,i=0

δ_((r+i)N) _(I) _(+D) _(c) =(T ^(N) ^(_(I)) +c ₀ h ^(t) T ^(N) ^(_(I))^(−D) ^(_(c)) )δ_((r+i)N) _(I) _(+D) _(c) , i=1, 2, . . . L−1  (Equation 7)

[0083] The relationship between the initial state difference vectorδ_(rN) _(I) and the final state difference vector δ_((r+L−1)N) _(I)_(+D) _(c) obtained after L time corrections is as follow.

δ_((r+L−1)N) _(I) _(+D) _(c) =Λδ_(rN) _(I)   (Equation 8)

[0084] In this equation, Λ is a L×L correction matrix being defined asfollows.

Λ=(T ^(N) ^(_(I)) +c ₀ h ^(t) T ^(N) ^(_(I)) ^(D) ^(_(c)) )^(L−1)(T ^(D)^(_(c)) +c ₀ h ^(t))   (Equation 9)

[0085] In order to accomplish the synchronization through L timecorrection, δ_((r+L−1)N) _(I) _(+D) _(c) has to be always a 0-vectorwithout regard to δ_(rN) This is achieved by making Λ a 0-matrix.Therefore, the synchronization problem of the DSA spreader anddespreader whose SRGs are characterized by T and h comes to the designproblem of N_(I), D_(c) and C₀ which make Λ a 0-matrix. The structure ofthe SRGs is determined according to the state transition matrix T andthe sampling structure of the SRG is determined according to thegeneration vector h. Therefore, because the overall structure isentirely determined by T and h, this structure is called “SRGcharacterized by T and h” in the preferred embodiment of the presentinvention.

Sampling and Correction Conditions for Synchronization

[0086] For the SRG of length L structured by the state transition matrixT and the generating vector h, the discrimination matrix, h is definedas follow. $\begin{matrix}{\Delta_{T,h} \equiv {\begin{matrix}h^{t} \\{h^{t} \cdot T^{N_{I}}} \\{h^{t} \cdot T^{2N_{I}}} \\\vdots \\{h^{t} \cdot T^{{({L - 1})}N_{I}}}\end{matrix}}} & \left( {{Equation}\quad 10} \right)\end{matrix}$

[0087] where N_(I) denotes the sampling interval.

[0088] Then, a following theorem concerned with the interval N_(I) forexecuting a sampling is established.

Theorem 1 Sampling Time Condition

[0089] For the non-singular state transition matrix T, if the samplinginterval N_(I) is chosen such that the discrimination matrix Λ_(T,h) ofEquation 10 becomes a nonreciprocal matrix, in spite of any choice ofcorrection delay time D_(c) and correction vector c₀, the correctionmatrix Λ of Equation 9 cannot become a 0-matrix.

[0090] Theorem 1 provides a necessary condition for selecting N_(I)necessitated to make the despreader SRG synchronizable with the spreaderSRG. According to this theorem, the period of the igniter sequenceshould be chosen such that the relevant discrimination matrix Λ_(T,h)becomes reciprocal.

[0091] Once the sampling interval N_(I) is selected so that Λ_(T,h) isreciprocal, then a following theorem concerned with the choice of thecorrection delay time D_(c) and the correction vector c₀ is established.

Theorem 2 Correction Period Condition

[0092] For a reciprocal state transition matrix T, let the samplinginterval N_(I) be chosen such that the discrimination matrix Λ_(T,h) isreciprocal. Then, the correction matrix Λ of Equation 9 becomes a0-matrix if the correction vector c₀ is evaluated, for an arbitrarycorrection delay time D_(c) in 0 D_(c)N_(I), by the following equation,$\begin{matrix}{c_{0} = {T^{{{({N - 1})}N_{I}} + D_{c}} \cdot \Delta_{T,h}^{- 1} \cdot e_{L - 1}}} & \left( {{Equation}\quad 11} \right)\end{matrix}$

[0093] where the L-vector e_(i-l) denotes the I-th standard basis vectorwhose I-th element is 1 and the others are 0. In the preferredembodiment of the present invention, when denoting the element locationin an L vector or an L×L matrix, a subscript variable n having a rangeof 1 and L×L instead of 0 and L×(L−1) is used.

[0094] The theorem for the correction period condition is proved asfollows.

[0095] To begin with, by expanding an equation Δ_(T,h)·Δ_(T,h) ⁻¹=I afollowing equation is obtained. $\begin{matrix}{{{h^{t} \cdot T^{iNI} \cdot \Delta_{T,h}^{- 1}} = e_{i}^{t}},{i - 0},1,\ldots \quad,{L - 1}} & \left( {{Equation}\quad 12} \right)\end{matrix}$

[0096] Since T is reciprocal, Equation 9 can be written asΛ=Λ*^(L)·T^(D) ^(_(c)) ^(−N) ^(_(I)) for Λ*=T^(N) ^(_(I))+c₀·h^(t)·T^(N) ^(_(I)) ^(−D) ^(_(c)) . Due to Equation 11, this Λ* canbe rewritten as $\begin{matrix}{\Lambda_{*} = {T^{{{({L - 1})}N_{I}} + D_{c}} \cdot \Delta_{T,h}^{- 1} \cdot \Delta_{T,h} \cdot T^{{{- {({L - 1})}}N_{I}} - D_{c}}}} \\{A_{e} = {{\Delta_{T,h} \cdot T^{N_{I}} \cdot \Delta_{T,h}^{- 1}} + {e_{L - 1} \cdot h^{t} \cdot T^{L\quad N_{I}} \cdot {\Delta_{T,h}^{- 1}.}}}}\end{matrix}$

[0097] When the relation in Equation 12 is applied to this equation, itreduces to A_(e)=[0, e₀, e₁, . . . e_(L−2)], which is a nilpotent matrixof nilpotency L×L. Therefore, since Λ_(e) ^(L)=0 and Λ*=0, Λ₌₀, whenΛ ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1)

[0098] is evaluated by using Equations 9 and 12 repeatedly, the relationΛ ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1) = T^((L − 1)N_(I) + D_(c)) ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1) + c₀

[0099] is finally obtained. Therefore, when A=0, thenc₀ = T^((L − 1)N_(I) + D_(c)) ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1).

[0100] Note that Theorem 2 does not impose any restriction on the choiceof correction time. Therefore, the correction time D_(c) is arbitrarilyselected from the range of (0, N_(I)]. A following theorem is derivedfrom the Theorems 1 and 2.

Theorem 3

[0101] For an M-sequence (PRBS) of period 2^(L)−1, {s_(k)}, generated bythe spreader SRG having the transition matrix T and the generatingvector h, when an arbitraryA_(e) = Δ_(T, h).T^(N_(I)) ⋅ Δ_(T, h)⁻¹ + e_(L − 1) ⋅ h^(t) ⋅ T^(L  N_(I)) ⋅ Δ_(T, h)⁻¹.

[0102] When the relation in Equation 12 is applied to this equation, itreduces to A_(e)=[0 e₀ e₁. . . e_(L−2)], which is a nilpotent matrix ofnilpotency L×L. Therefore, since A_(e) ^(L)=0 and A*=0, Λ₌₀, whenΛ ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1)

[0103] is evaluated by using Equations 9 and 12 repeatedly, the relationΛ ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1) = T^((L − 1)N_(I) + D_(c)) ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1) + c₀

[0104] is finally obtained. Therefore, when Λ=0, thenc₀ = T^((L − 1)N_(I) + D_(c)) ⋅ Δ_(T, h)⁻¹ ⋅ e_(L − 1).

[0105] Note that Theorem 2 does not impose any restriction on the choiceof correction time. Therefore, the correction time D_(c) is arbitrarilyselected from the range of (0, N_(I)]. A following theorem is derivedfrom the Theorems 1 and 2.

Theorem 3

[0106] For an M-sequence (PRBS) of period 2^(L)−1, {s_(k)} generated bythe spreader SRG having the transition matrix T and the generatingvector h, when an arbitrary sequence whose period, N_(I), is relativelyprime to the period of the M-sequence is taken as the igniter sequenceand the despreader SRG is easily synchronized with the spreader SRG byusing the DSA scheme of the present invention equipped with the singlecorrection vector c₀ of Equation 11. This theorem is proved as follow.

[0107] {t_(k)} denotes an igniter sequence of period N₁ and N₁ isrelatively prime to 2^(L)−1. The sequence generated by sampling thegiven M-sequence {s_(k)} at each start of the igniter sequence period isan N₁-decimated sequence of the original M-sequence, and thus becomes anM-sequence of period 2^(L)−1. This new sequence is denoted by {s_(k)},and then {s_(k)} has the transition matrix T=T_(Ni) and I the generatingvector h.

[0108] Now, the case that Δ_(T,h) is singular is described. There existsa lowest degree non-constant polynomial Φ (x) whose degree is lower thanL and h^(t·Φ(T)=)0. Since {s_(k)} is a binary M-sequence of period2^(L)−1, the characteristic polynomial C_(T)(x) of the L×L matrix T is aprimitive polynomial of degree L×L over GF(2). Dividing C_(T)(x) byΦ(x), the relation C_(T)(x)=Φ(x)Q(x)+R(x) is obtained, where the degreeof R(x) is lower than that of Φ(x). Substituting x=T, then multiplyingh^(t) to the left of each side of the relation, and finally applying therelation Φ(T)=0, h^(t)R(T)=0 is obtained. Since the degree of R(x) islower than that of Φ(x), R(x) should be zero by the definition of Φ(x).Therefore, Φ(x) divides C_(T)(x). But, it is a contradiction because nonon-constant polynomial whose degree is lower than L can divide aprimitive polynomial of degree L. As the result, Δ_(T,h) must besingular.

[0109] Therefore, according to Theorem 1, the despreader SRG issynchronized by the igniter sequence {t_(k)} of period N_(I), and, byTheorem 2, the synchronization can be done using the single correctionvector c₀ specified in Equation 11.

[0110] According to Theorem 3, any of the extended M-sequence may beused as the igniter sequence, since the period of each extendedM-sequence is relatively prime to those of the M-sequences. Theresulting DSA despreader has simple circuitry as the single correctionvector c₀ works well on it.

[0111] A process for implementing the time-advanced sampler 112 shown inFIG. 4A is described in the following. This process is achieved byemploying a new sampling vector as specified in the following theorem.

Theorem 4 Time-Advanced Sampling Circuit

[0112] (r+I)N_(I)(r−t−I)N_(I) denotes the sampling time when a samplez_(i) is taken from an SRG structured by the state transition matrix Tand the generating vector h. Then, the sample z_(i) is identical to thesample taken at time (r+I−1)N_(I) by using the sampling vector definedby

ν₀=(T ^(N) ^(_(I)) )^(t) ·h   (Equation 13)

[0113] This equation is proved as following. The sequence data generatedat time (r+I−1)N_(I) may be represented by

s _((r+i)N) _(I) =h ^(t) ·T ^((r+i)N) ^(_(I)) ·d ₀=((T ^(N) ^(_(I)))^(t) ·h)·T ^((r+i−1)N) ^(_(I)) ·d ₀=((T ^(N) ^(_(I)) )^(t) ·h)^(t) ·d_((r+i−1)N) _(I)

[0114] This implies

s _((r+i)N) _(I) =ν₀ ^(t) ·d _((r+i−1)N) _(I)

[0115] for

ν₀=(T ^(N) ^(_(I)) )^(t) ·h

[0116] When the sequence {s_(k)} is sampled at time (r+I−1)N_(I) byusing the sampling vector (T^(ni))^(t)h, the sampled data is identicalto the sequence data generated at time (r+I)N_(I).

[0117] Based on the theories explained beforehand, the DSAsynchronization parameters are selected according to the followingprocedure. Given an SRG structured by the state transition matrix T andthe generating vector h, at first, the igniter sequence period isselected to be an integer relatively prime to the period 2^(L)31 1 ofthe main SRG sequence. Then, a value which is positive number and is notgreater than N₁ is arbitrarily taken as the correction delay D_(c).

[0118] Finally, the correction vector c₀ and the time-advanced samplingvector v₀ are determined by the Equations 11 and 13, respectively. Anexample in which the main SRG sequence is an M-sequence whosecharacteristic polynomial is Ψ(x)=x¹⁵+x¹³+x⁸+x⁷+x⁵+1, with thetransition matrix T and generating vector h of the main SRG given by$\begin{matrix}{T = {\begin{matrix}{{0_{141}}I_{1414}} \\{1000010111000010\quad}\end{matrix}}} & \left( {{Equation}\quad 14a} \right)\end{matrix}$

h=[100000000000000]  (Equation 14b)

[0119] is described in the followings. In this example, the SRG lengthL×L is 15. When the igniter sequence is an extended M-sequence of period128, whose start is marked up, for example, by the symbol “1” in the8-bit string “00000001”, the sampling interval N_(I) becomes 128 and thesampling matrix Δ_(T,h) in Equation 10 becomes nonsingular. When thecorrection delay time D_(c) is set to 1, the correction vector andtime-advanced sampling vectors are obtained as follows.

C_(o)=[110111001111001],   (Equation 15a)

V_(o)=[101101110000010]  (Equation 15b)

[0120]FIGS. 6A and 6B show DSA spreader 11DB and DSA despreader 210Bwhich include a time-advanced sampler and correction vectors,respectively. FIGS. 6A and 6B correspond to DSA spreader 110 and DSAdespreader 210, respectively.

[0121] The evaluations of a mean acquisition time and a complexity ofDSA scheme of the preferred embodiment of the present invention aredescribed next.

Mean Acquisition Time Evaluation

[0122] The total time spent in the synchronization process, from theinstant when the igniter sequence conveying the main SRG state symbolbegins to the instant when the transmission of the true synchronizationis confirmed is defined as an acquisition time in the present invention.It includes the time for igniter sequence acquisition, main SRGcorrection, and synchronization verification.

[0123] In evaluating the mean acquisition time, after tracking all thetime consumption factors the moment generating function method (i.e.,z-domain Narkoff chain approach) is applied. To be more specific, p(n)denotes the probability to reach the main sequence acquisition state inn time units (i.e., n×τ_(D)), and then its moment generating functionP_(ACQ)(z) is given by${P_{ACQ}(z)} = {\sum\limits_{n = 0}^{\infty}\quad {{p(n)}z^{n}}}$

[0124] The mean and variance of the acquisition time T_(acq), aredetermined by employing the first and second derivatives of P_(ACQ)(z)at z=1.

[0125] For the performance evaluation, the time τ_(D) for each of thefollowing precesses: one phase comparison in the igniter sequencesearching stage, one state sample detection in the main SRG correctionstage, and one verification in the main sequence synchronizationverification stage is assumed to be the same fixed.

[0126] In the igniter sequence searching stage, verification logics arenot employed to make the evaluation simple, even though their employmentwould possibly reduce the overall acquisition time. In addition, thephase is assumed to advance by the step size of 1-chip, and the simpleverification procedure explained beforehand is employed for the mainsequence synchronization verification.

[0127] As concerned with the igniter sequence synchronization, theprobability that the detector declares a true “in-phase” state per run(i.e., one round of shift of the igniter sequence) is defined as adetection probability per run, P_(d,r) and the probability that thedetector declares a false “in-phase” state per phase (or “cell”) isdefined as a false acquisition probability per run, P_(fa,c).

[0128] After the igniter sequence acquisition, regardless of thetrueness of the acquisition, the conveyed state sample is detected outof the acquired igniter sequence.

[0129] When P_(e) denotes the binary decision error probability cause bythe channel noise, the correct state sample decision probability isgiven by P_(C)=1−P_(e) in the case that the igniter sequence issynchronized, and is ½ for the case that the igniter sequence is notsynchronized.

[0130] In order to analyze the acquisition process of the DSA apparatusaccording to the present invention, the state transition diagram of theDSA based acquisition process is first derived. For this, a state jdenotes the state of the receiver generated igniter sequence whose phaseadvances the received igniter sequence by j mod N_(I) chips. Among theN_(I) possible states, 0 through N_(I)−1, state 0 corresponds to thetrue “in-phase” state. States FA_(i), ACQ_(i), FA_(m) and ACQ denote theigniter sequence false alarm, igniter sequence acquisition, mainsequence false alarm and main sequence acquisition states, respectively.

[0131] Therefore, based on the acquisition procedure described in theabove explanation and in FIGS. 3A and 3B, the state transition diagramof the overall acquisition process is obtained as the circular diagramshown in FIG. 7.

[0132] In FIG. 7, the prior probabilities are not included, for whichthe uniform distribution is employed in the present invention, where theprobability to be initially at state 1 is unity and that for all otherstates is zero. The states ACQ_(i) and FA_(i) are put twice for eachsegment to make the graph planar.

[0133] Referring to FIG. 7, while it is straightforward to evaluate themain acquisition time, the resulting expressions are exceedingly bulky.In order to generate meaningful and practical expressions, the momentgenerating functions are modified by applying the fact that L×L and Vare set, in practice, large enough to make (½)^(L+V)=0. Thismodification is applied to equations 8 and 9 to evaluate the meanacquisition time, as the structure of the flow graph in FIG. 7 changesto that in FIG. 3.

[0134] Consequently, the following mean acquisition times of the DSAapparatus according to the present invention are obtained as followsaccording to a worst distribution (W) and a uniform distribution (U),respectively. $\begin{matrix}{{E\left( T_{acq}^{W,{DSA}} \right)} = {\frac{1}{P_{d,r}P_{c}^{L + V}}{\quad{\begin{bmatrix}{1 + {P_{d,r}\left\{ {L + 3 - P_{c}^{L} + {\frac{P_{c} - P_{c}^{V}}{1 - P_{c}}P_{c}^{L}} + \frac{\left( {K - 2} \right)\left( {1 - P_{c}^{L}} \right)}{2^{V}}} \right\}}} \\{{{+ \left( {N_{I} - 1} \right)}\left\{ {1 + {P_{{ja},c}\left( {L + {2\frac{K - 2}{2^{V}}}} \right)}} \right\}}\quad}\end{bmatrix}{\quad{\quad{{\cdot \tau_{D}}\quad}}}}}}} & \left( {{Equation}\quad 16a} \right) \\{{E\left( T_{acq}^{U,{DSA}} \right)} = {\frac{1}{P_{d,r}P_{c}^{L + V}}{\quad{\begin{bmatrix}{1 + {P_{d,r}\left( {L + 3 - P_{c}^{L} + {\frac{P_{c} - P_{c}^{V}}{1 - P_{c}}P_{c}^{L}} + \frac{\left( {K - 2} \right)\left( {1 - P_{c}^{L}} \right)}{2^{V}}} \right)} +} \\{\left( {N_{I} - 1} \right)\left\{ {1 + {P_{{ja},c}\left( {L + {2\frac{K - 2}{2^{V}}}} \right)}} \right\} \left( {1 - \frac{P_{d,r}P_{c}^{L - V}}{2}}\quad \right)}\end{bmatrix}{\quad{\quad{\cdot \tau_{D}}}}}}}} & \text{(Equation~~~16b)}\end{matrix}$

[0135] On the other hand, the mean acquisition time of the conventionalserial search acquisition (SSA) can be easily determined.$\begin{matrix}{{E\left\{ T_{acq}^{W,{SSA}} \right\}} = {{\frac{1}{P_{d,r}^{V + 1}}\left\lbrack {1 + {P_{d,r}\frac{1 - P_{d,r}^{V}}{1 - P_{d,r}}} + {\left( {N_{M} - 1} \right)\left( {1 + {P_{{fa},c}\left( {\frac{1 - P_{{ja},c}^{V}}{1 - P_{{ja},c}} + {KP}_{{fa},c}^{V}} \right)}} \right)}} \right\rbrack} \cdot \tau_{D}}} & \left( {{Equation}\quad 17a} \right) \\{{E\left\{ T_{acq}^{U,{SSA}} \right\}} = {{\frac{1}{P_{d,r}^{V + 1}}\left\lbrack {1 + {P_{d,r}\frac{1 - P_{d,e}^{V}}{1 - P_{d,r}}} + {\left( {N_{M} - 1} \right)\left( {1 + {P_{{ja},c}\left( {\frac{1 - P}{1 - P_{{ja},c}} + {KP}_{{ja},c}^{V}} \right)}} \right\} \left( {1 - \frac{P_{d,r}^{V + 1}}{\quad}} \right)}} \right\rbrack} \cdot \tau_{D}}} & \left( \text{Equation~~~17b} \right)\end{matrix}$

[0136] In the verification procedure of the serial search acquisitionapparatus, when a correlation larger than a threshold value V times in arow after the in-phase state is obtained the acquisition completion isdeclared. Otherwise, the procedure returns to the search stage. For theevaluation simplicity, dwell times for determining the in-phasecondition in the verification and search stages are assumed to beidentical. As the result, for the case of V=0, Equation 17a and 17breduce to Equation 18a and 18b as follows. $\begin{matrix}{{E\left\{ T_{acq} \right\}} = {P_{d,r} - {1\left( {1 + {\left( {1 + {KP}_{{FA}.C}} \right)\left( \frac{v - 1}{2} \right)\left( {2 - P_{d,r}} \right)}} \right){\tau_{D}\left( {{uniform}\quad {distribution}} \right)}}}} & \left( {{Equation}\quad 18a} \right)\end{matrix}$

 E{T _(acq) }=P _(d,r)−1(1+(ν−1)(1+KP _(FA,C)))τ_(D)   (Equation 18b)

[0137] (worse-case distribution)

[0138] Based on Equations 16a, 16b, 17a, and 17b, the acquisitionperformances of the DSA apparatus according to the present invention arecompared with those of the conventional SSA.

[0139] Under the assumption that the detection probability P_(d,r) is0.99, the false alarm probability P_(fa,c) is 0.01. When the false alarmpenalty factor K is 1000, the false alarm penalty time is 1000_(D) Thestate symbol error probability Pe (=1−P_(c)) of 0.01.

[0140] In the example of the preferred embodiment of the presentinvention, the probabilities are assumed to be constant for theevaluation simplicity, but the probabilities P_(d,r), P_(fa,c) andP_(d,r) are related to each other and determined according to the chipSNR, N_(I), a threshold value, and so forth.

[0141]FIG. 8 shows the comparison result for the two schemes in terms ofmean acquisition times and their ratio, for varying verification stepsize V of 0 through L×L−1.

[0142] Referring to FIG. 8, the dots on the curves indicates the optimalverification step sizes that minimize the mean acquisition time, and thedramatic improvements in acquisition time for the DSA apparatusaccording to the present invention are observed. That is, the meanacquisition time of the DSA apparatus becomes more than 100 timesshorter than that of the conventional SSA scheme.

[0143]FIGS. 9A and 9B show the graphs of the acquisition time ratio ofthe DSA apparatus over the conventional SSA scheme in terms of falsealarm penalty factor K (for L×L=15) and main sequence SRG length L×L(for K=1000), respectively.

[0144]FIG. 9A shows that the ratio increases as the penalty timeincreases, but within the same order of magnitude. FIG. 9B shows thatthe acquisition time ratio decreases exponentially as the SRG lengthincreases. Thus, the advantage of the DSA apparatus according to thepresent invention becomes substantial for long PN sequences.

Implementation Complexity of DSA Apparatus

[0145] The implementation complexity of the DSA apparatus according tothe preferred embodiment of the present invention is explained asfollows.

[0146] Referring to FIGS. 1A and 1B, the implementation of the DSAapparatus is preferably done by installing an igniter sequencegeneration block including a short length SRG, a time-advanced samplingcircuit in the transmitter block, and a correction circuit and averification circuit in the receiver block in addition to theconventional serial search acquisition device.

[0147] However, in spite of all of the functional increases, therequired hardware increase is very little, as shown in FIG. 6. To bemore specific, the sampling and correction circuits are implemented by afew gates and wirings. A simple counter is enough for the verificationlogic, and the existing data symbol generation and detection blocks maybe arranged to carry out the state symbol generation and detectionfunction, without adding additional hardware. On the contrary, aparallel search scheme, which is the only scheme comparable to the DSAscheme of the present invention in terms of acquisition time, requiresas much hardware penalty as the acquisition time gain, because thereduction in acquisition time is directly proportional to the number ofduplications of parallel branches. Consequently, the required hardwarecomplexity is much higher for the parallel search scheme than that ofthe DSA scheme according to the present invention. In order to achievethe acquisItion time ratio of 0.01, the parallel search scheme requiresmore that 100 parallel branch circuits each of which contains an SRGhaving its own initial state values and detection circuits.

[0148] According to the preferred embodiment of the present invention,at least two major problems related to SRG state-based acquisitionreliable conveyance of the state samples in the practical low SNR CDMAchannels and effective manipulation of the conveyed state samples forsynchronization acquisition, are solved by the proposed DSA techniques.

[0149] In the DSA scheme according to the preferred embodiment of thepresent invention, the short-period igniter sequence which is intendedto convey the state samples of the main SRG, is synchronized throughconventional serial search, but the long-period main sequence is itselfsynchronized by the conveyed state samples.

[0150] The design method of the DSA scheme according to the presentinvention is provided through theorems, which include sampling time,time-advanced sampling circuit, correction time, and correction circuit.

[0151] The mean acquisition time of the DSA scheme according to thepresent invention reduces dramatically at the cost of small hardwareincrease. For example, in the case of the PN sequence of period 2¹⁵−1,the mean acquisition time of the DSA scheme according to the presentinvention reduces to a hundredth of that of the conventional serialsearch acquisition schemes.

[0152] Furthermore, the DSA scheme according to the present inventiondoes not require the coherent acquisition that used to be required bysome existing sequential estimation techniques.

[0153] It will be apparent to those skilled in the art that variousmodifications and variations can be made in the distributed sampleacquisition scheme of the present invention to obtain a fast acquisitionof PN sequence without departing from the spirit or scope of theinvention. Thus, it is intended that the present invention covers themodifications and variations of this invention provided they come withinthe scope of the appended claims and their equivalents.

[0154] The foregoing embodiments and advantages are merely exemplary andare not to be construed as limiting the present invention. The presentteaching can be readily applied to other types of apparatuses. Thedescription of the present invention is intended to be illustrative, andnot to limit the scope of the claims. Many alternatives, modifications,and variations will be apparent to those skilled in the art. In theclaims, means-plus-function clauses are intended to cover the structuresdescribed herein as performing the recited function and not onlystructural equivalents but also equivalent structures.

What is claimed is:
 1. A method for performing a fast acquisition of aPseudo Noise (PN) sequence in a transmitter, comprising: spreading andtransmitting a state signal for a main shift register generator by anigniter sequence; and spreading and transmitting a data signal by a mainsequence generated by the main shift register generator.
 2. The methodof claim 1, further comprising: receiving and despreading the statesignal for the main shift register generator of the transmitter by theigniter sequence; and receiving and despreading the data signal by themain sequence based on the state signal.
 3. The method of claim 1,wherein the igniter sequence and the main sequence are transmittedsimultaneously.
 4. The method of claim 1, wherein the igniter sequenceis generated using a plurality of shift register generators (SRGs), andwherein each of the plurality of a SRGs has a different structure thanthe structure of the other a SRGs.
 5. A method for performing a fastacquisition of a Pseudo Noise (PN) sequence in a receiver, comprising:receiving and despreading a state signal for a main shift registergenerator
 6. The method of claim 5, further comprising: detecting thedata signal by tracking the main sequence; reconfirming asynchronization state obtained during the detecting step; and continuingthe detecting step in succession when an accurate acquisition isconfirmed by observing detection characteristics for a prescribed periodof time, retracting an acquisition complete message if it is determinedthat acquisition is not correct, and re-executing receiving and thespreading a state signal for the main shift register generator of thetransmitter by the igniter sequence.
 2. The method claimed in claim 1,wherein said the first igniter sequence has a period equal to a durationof a single bit of a data symbol.
 3. The method claimed in claim 1,wherein receiving and synchronizing the first igniter sequencecomprises: acquiring the first igniter sequence transmitted from thetransmitter; and determining an acquisition completion of the firstigniter sequence.